reachability graph
英 [riːtʃəˈbɪlɪti ɡræf]
美 [ˌritʃəˈbɪlɪti ɡræf]
网络 可达图; 有向可达图; 可达树
双语例句
- The reachability matrix of directed graph plays a very important role on identifying whether a directed graph to be strongly connected or not and calculating the strongly connected sub graph.
图的可达性矩阵在判断图的强连通性以及求强连通分图中具有重要作用。 - FLS: A Labeling Scheme to Solve the Reachability Problem of Dynamic Updating Graph
FLS：一种支持更新的图可达性标记算法 - Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.
可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。 - The load balanced FMS scheduling method based on Petri Net get result by searching models reachability graph using AI technique.
基于Petri的FMS负载平衡调度，以Petri网为建模工具，利用人工智能搜索模型可达图，获得调度结果。采用TPPN构造各生产单元的PN子网，通过共享资源库将其连接。 - In this paper, an analysis method on input buffer limitation is discussed, and its generalized stochastic Petri nets model and reachability graph are built. Therefore, input buffer limitation mechanism can be described and analyzed.
提出了一种限制输入缓存器方案的广义随机Petri网模型，并给出了可达图及MC，从而可描述、分析限制输入缓存器方案的入口模式。 - A simple and direct algorithm for computing reachability matrix of directed graph is introduced and proved.
介绍了采用邻接矩阵作关系矩阵解有向图的可达矩阵的一种简捷算法&轮流做媒法。 - An Approach to Construction of Reachability Graph of Petri Net
一种构造Petri网可达图的方法 - It is proved that there is no need to calculate the reachability matrix for a Directed Acyclic Graph ( DAG).
证明了对于一类特殊的有向图即有向无环图（DAG），应用解释结构建模法无须求解可达矩阵亦可保证建模结构化的实现。 - The method need not analyze reachability graph and its online computation has only a complexity of polynomial times. More importantly, the method can be applied to more general Petri nets than existing similar methods.
该方法无需进行可达图分析，在线计算复杂性仅为多项式级，而且与已有方法相比可以应用到更一般的Petri网。 - A way of fuzzy cluster is provided, which is combined with reachability matrix and the idea of region partition in graph theory, in order to find out the number of the hidden layer nodes of RBF neural network.
本文提出一种同图论中可达矩阵和区域划分思想相结合的模糊聚类方法，以此来确定RBF网络的隐含层节点数。 - In the view of analysis method, the reduction rule of CPN was extended, which is integrated with the reachability graph to check the liveness and bound properties of interactive protocol model.
在交互协议分析方面，对CPN模型简化规则进行了扩展，提出了集成简化规则和可达图的定性分析方法。 - Temporal Property Analysis of Discrete Event Systems Based on State Reachability Graph
基于状态可达图的离散事件系统时态性质分析 - Reachability matrix of directed graph and calculation based on matrix calculation
基于布尔矩阵运算的有向图可达矩阵 - For quantitative solution, we study GSPN and find that the reachability graph of a GSPN is isomorphic to a Continuous Time Markov Process ( CTMP) when the vanishing markings are eliminated, so Markov Process method can be used.
在安全性定量分析方面，我们研究发现去除消失标识后，GSPN的可达图与一个连续时间Markov过程（CTMP）是同构的，为此，可利用Markov过程方法进行分析。 - By using of the characters of safe Petri nets, a place invariant generation algorithm which uses the reachability tree of safe Petri nets and complete graph of mth order with self-loop is presented.
利用安全Petri网的特点，提出一种由安全Petri网可达树和带自环的m阶完全图来计算位置不变式的生成算法。 - Petri net is a kind of good tool to describe concurrent and asynchronous system, there are many methods to analyze Petri net, such as reachability graph, reachability tree, incidence matrix and so on. However, its correctness can be proved by mathematics method.
Petri网是一个描述异步并发的图形工具，具有可达树、可达图、关联矩阵等多种分析方法，并且可以通过数学方法来证明其正确性； - So a certification management flow modeling is designed based on Petri-net'P/ T system. Its integrity is analysed by the theory of state reachability graph.
文中使用Petri网理论中的库所/变迁系统模型对一个CA证书管理流程进行建模，并用状态可达图理论对其系统的完备性进行了分析与证明。 - Then some analysis techniques of Petri net such as reachability graph are used to verify the two new features in the system arid we can obtain a number of important properties of the system.
接着使用可达图等Petri网分析技术对系统中的两种新功能进行验证，从而得到系统的若干重要性质。 - With the directed graph theory, the DGM model of the MPMS switching system is proposed, and the characters including neighboring relations and port reachability are defined, and the model graph is also provided.
运用有向图建模理论，提出了MPMS交换结构的有向图DGM模型，定义了DGM模型的相邻连通性和端口可达性等模型特征，并提出了MPMS的模型拓扑图。 - This approach traces program method execution, and builds dynamic system dependence graph by combining the dynamic execution information and program static information. And compute slice by two-pass graph reachability algorithm on the dynamic dependence graph.
该方法跟踪程序方法的执行，利用程序动态执行信息和静态信息建立动态系统依赖图，并在动态系统依赖图上采用两步图可达性算法获得动态切片。